On propositional quantifiers in provability logic.

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On propositional quantifiers in provability logic

The first order theory of the Diagonalizable Algebra of Peano Arithmetic (DA(PA)) represents a natural fragment of provability logic with propositional quantifiers. We prove that the first order theory of the O-generated subalgebra of DA(PA) is decidable but not elementary recursive; the same theory, enriched by a single free variable ranging over DA(PA), is already undecidable. This gives a ne...

متن کامل

Propositional Dynamic Logic with Program Quantifiers

We consider an extension QPDL of Segerberg-Pratt’s Propositional Dynamic Logic PDL, with program quantification, and study its expressive power and complexity. A mild form of program quantification is obtained in the calculus μPDL, extending PDL with recursive procedures (i.e. context free programs), which is known to be Π 1 -complete. The unrestricted program quantification we consider leads t...

متن کامل

On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs

Kripke-style semantics is suggested for the provability logic with quantifiers on proofs corresponding to the standard Gödel proof predicate. It is proved that the set of valid formulas is decidable. The arithmetical completeness is still an open issue.

متن کامل

Notes on Provability Logic

This notes provides a brief survey that reflects the early development of provability logic. It includes a detailed exposition of Gödel’s incompleteness results, the Löb theorem, and the arithmetical completeness theorems of Solovay.

متن کامل

On Provability Logic

This is an introductory paper about provability logic, a modal propositional logic in which necessity is interpreted as formal provability. We discuss the ideas that led to establishing this logic, we survey its history and the most important results, and we emphasize its applications in metamathematics. Stress is put on the use of Gentzen calculus for provability logic. We sketch our version o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1993

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093634729